Super Paramagnetic Clustering of Data (spc)
نویسندگان
چکیده
1 Summary A new clustering algorithm named Super Paramagnetic Clustering (SPC) which was published by Blatt et al. 1]]2]]3] is described. The algorithm, which was rst motivated by properties of inhomogeneous magnets, is described as an outcome of a general technique to create robust clustering algorithms. The technique uses a clustering cost function and nds the average custering solution at diierent average costs. One can usually nd several intervals of average cost values (phases) at which the average clustering solution is stable and has a unique behavior. Each of these stable solutions represent a real property of the data as it appeared in most of the clustering proposals at this average cost. All is left, is to choose one or several solutions out of the stable ones in order to represent the structure in the data. Note, that all is needed in order to use this technique is to construct a clustering cost function. The cost function should incorporate all the preferences one has regarding the clustering, therefore, all clustering proposals with the same cost should be considered as good. The SPC algorithm is a non-parametric clustering algorithm and as such it is based on local criteria. The SPC cost function penalizes assigning close points to diierent clusters. Each point x i is assigned a \color" s i = 1; : : : ; q. Any neighboring couple, < i; j >, whose colors do not agree has to pay a penalty J ij that decays with distance. The cost function is deened as
منابع مشابه
Super-paramagnetic clustering of yeast gene expression profiles
High-density DNA arrays, used to monitor gene expression at a genomic scale, have produced vast amounts of information which require the development of efficient computational methods to analyze them. The important first step is to extract the fundamental patterns of gene expression inherent in the data. This paper describes the application of a novel clustering algorithm, Super-Paramagnetic Cl...
متن کاملSuper paramagnetic clustering of yeast gene expression pro les
High density DNA arrays used to monitor gene expression at a genomic scale have produced vast amounts of information which require the development of e cient computational methods to analyze them The important rst step is to extract the fundamental patterns of gene expression inherent in the data This paper de scribes the application of a novel clustering algorithm Super Paramagnetic Cluster in...
متن کاملOxygen reduction reaction on Pt/C at the presence of super paramagnetic of Fe3O4 nanoparticles for PEMFCs
In this paper the role of super paramagnetic iron oxide nanoparticles (SPI) on Platinum nanoclusters on activated carbon (Pt/C) for electrocatalytic oxygen reduction reaction was considered. Four composites of Pt/C and super paramagnetic iron oxide nanoparticles were prepared with the same total composites weight and different loading of Pt/C (1.2, 0.6, 0.4 and 0.3 mg ). The composite attached ...
متن کاملNetView: A High-Definition Network-Visualization Approach to Detect Fine-Scale Population Structures from Genome-Wide Patterns of Variation
High-throughput sequencing and single nucleotide polymorphism (SNP) genotyping can be used to infer complex population structures. Fine-scale population structure analysis tracing individual ancestry remains one of the major challenges. Based on network theory and recent advances in SNP chip technology, we investigated an unsupervised network clustering method called Super Paramagnetic Clusteri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007